We present new variations on the product replacement method for generating random elements in a black box group, together with some basic analysis and conjectures.

For a black box group G and t an involution of G we describe a computational procedure which produces elements of CG(t) by making use of the local fusion graph F(G, X), where X is the G-conjugacy class of t.

Automatic program evaluation is a way to assess source program files. These techniques are used in learning management environments, programming exams and contest systems. However, use of automated program evaluation encounters problems: some evaluations are not clear for the students and the system messages do not show reasons for lost points. The author proposes several ideas for possible imp...

We introduce a new approach in black box group theory which deals with black box group problems in the category of black boxes and their morphisms. This enables us to enrich black box groups by actions of outer automorphisms such as Frobenius maps or graph automorphisms of simple groups of Lie type. As an application of this new technique, we present a number of new results, including a solutio...

in the software development process, testing is one of the most human intensive steps. many researchers try to automate test case generation to reduce the manual labor of this step. negative selection is a famous algorithm in the field of artificial immune system (ais) and many different applications has been developed using its idea. in this paper we have designed a new algorithm based on nega...

Constrained objects provide a suitable object-oriented style for modeling systems under constraints. A set of classes is defined to represent a problem, whose state is then controlled by a constraint satisfaction engine. This engine is commonly a black-box based on a predefined and non-customizable search strategy. This system rigidity, of course, does not allow users to tune models in order to...

We show that the unrestricted black-box complexity of the n-dimensional XORand permutation-invariant LeadingOnes function class is O(n log(n)/ log logn). This shows that the recent natural looking O(n logn) bound is not tight. The black-box optimization algorithm leading to this bound can be implemented in a way that only 3-ary unbiased variation operators are used. Hence our bound is also vali...